Application of Computational Tools for Finitely Presented Groups
نویسندگان
چکیده
Computer based techniques for recognizing finitely presented groups are quite powerful. Tools available for this purpose are outlined. They are available both in stand-alone programs and in more comprehensive systems. A general computational approach for investigating finitely presented groups by way of quotients and subgroups is described and examples are presented. The techniques can provide detailed information about group structure. Under suitable circumstances a finitely presented group can be shown to be soluble and its complete derived series can be determined, using what is in effect a soluble quotient algorithm.
منابع مشابه
Embedding Free Burnside Groups in Finitely Presented Groups
We construct an embedding of a free Burnside group B(m, n) of odd n > 2 and rank m > 1 in a finitely presented group with some special properties. The main application of this embedding is an easy construction of finitely presented non-amenable groups without noncyclic free subgroups (which provides a finitely presented counterexample to the von Neumann problem on amenable groups). As another a...
متن کاملJu n 19 94 Algorithms for Groups ∗
Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide application. Because of its relative maturity, computational group theory may be used to gain insight into the general structure of algebraic algorithms. This paper examines the basic ideas behind some of the more impor...
متن کاملIsoperimetric and Isodiametric Functions of Groups
This is the first of two papers devoted to connections between asymptotic functions of groups and computational complexity. One of the main results of this paper states that if for every m the first m digits of a real number α ≥ 4 are computable in time ≤ C22Cm for some constant C > 0 then nα is equivalent (“big O”) to the Dehn function of a finitely presented group. The smallest isodiametric f...
متن کاملConstructing Matrix Representations of Finitely Presented Groups
The Todd-Coxeter coset enumeration algorithm is one of the most powerful tools of computational group theory. It may be viewed as a means of constructing permutation representations of nitely presented groups. In this paper we present an analogous algorithm for directly constructing matrix representations over many elds. In fact the algorithm is more general than this, and can be used to constr...
متن کاملAn Efficient Strategy for Word-Cycle Completion in Finitely Presented Groups
We present an efficient strategy for the application of the inference rules of a completion procedure for finitely presented groups. This procedure has been proposed by Cremanns and Otto and uses a combinatorial structure called word-cycle. Our strategy is complete in the sense that a set of persistent word-cycles can be used to solve the reduced word problem of the finitely presented group giv...
متن کامل